On middle cube graphs
نویسندگان
چکیده
We study a family of graphs related to the n-cube. The middle cube graph of parameter k is the subgraph of Q2k−1 induced by the set of vertices whose binary representation has either k − 1 or k number of ones. The middle cube graphs can be obtained from the wellknown odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors).
منابع مشابه
Influence of insertion of holes in the middle of obstacles on the flow around a surface-mounted cube
The aim of our study is to analyze the impact of insertion holes in the middle of obstacles on the flow around a surface-mounted cube, In order to do this; we studied four configurations of obstacles in a channel with a Reynods number based on obstacle height ReH = 40000. The hexahedral structured meshes were used to solve the fluid dynamics equations .The finite volume method are employed to s...
متن کاملTenacity and rupture degree parameters for trapezoid graphs
Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs can be computed in polynomial time.
متن کاملOn Θ-graphs of partial cubes
The Θ-graph Θ(G) of a partial cube G is the intersection graph of the equivalence classes of the Djoković-Winkler relation. Θ-graphs that are 2-connected, trees, or complete graphs are characterized. In particular, Θ(G) is complete if and only if G can be obtained from K1 by a sequence of (newly introduced) dense expansions. Θ-graphs are also compared with familiar concepts of crossing graphs a...
متن کاملNote on Half-cube Embeddings
We establish some results on embeddings in half-cube graphs. They are motivated by M. Deza, M. Dutour Sikirić, and S. Shpectorov’s conjecture [1] concerning isometric embeddings of the skeletons of polytope Wythoffians in half-cube graphs.
متن کاملA note on minimum linear arrangement for BC graphs
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, Z-cubes, etc. as the subfamilies.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EJGTA
دوره 3 شماره
صفحات -
تاریخ انتشار 2015